Secrecy in the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. The results show, for example, that the proposed scheme achieves the same rate as the capacity without the secrecy constraints, in the initial part of the weak interference regime. Also, sharing random bits through the cooperative link can achieve a higher secrecy rate compared to sharing data bits, in the very high interference regime. The results highlight the importance of limited transmitter cooperation in facilitating secure communications over 2-user interference channels.Comment: 5 pages, submitted to SPAWC 201

Secure Communications for the Two-user Broadcast Channel with Random Traffic

In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. We consider the scenario, where one of the receivers has a secrecy constraint and its packets need to be kept secret from the other receiver. This is achieved by employing full-duplexing at the receiver with the secrecy constraint, so that it transmits a jamming signal to impede the reception of the other receiver. In this context, the stability region of the two-user BC is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The effect of self-interference due to the full-duplex operation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue, whose packets does not require to be kept secret under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. In particular, it is shown that the stability region with secrecy constraint is sensitive to the coefficient of self-interference cancelation under certain cases.Comment: Submitted for journal publicatio

Multiuser Cognitive Radio Networks: An Information Theoretic Perspective

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different ways of message-sharing between the primary and secondary (or cognitive) transmitters. Three natural extensions of unidirectional message-sharing from two users to three users are introduced: (i) Cumulative message sharing; (ii) primary-only message sharing; and (iii) cognitive-only message sharing. To emphasize the notion of interference management, channels are classified based on different rate-splitting strategies at the transmitters. Standard techniques, superposition coding and Gel'fand-Pinsker's binning principle, are employed to derive an achievable rate region for each of the cognitive interference channels. Simulation results for the Gaussian channel case are presented; they enable visual comparison of the achievable rate regions for different message-sharing schemes along with the outer bounds. These results also provide useful insights into the effect of rate-splitting at the transmitters, which aids in better interference management at the receivers.Comment: 50 pages, 15 figures, submitted to IEEE Transactions on Information Theor

Outer Bounds on the Sum Rate of the K-User MIMO Gaussian Interference Channel

This paper derives outer bounds on the sum rate of the K-user MIMO Gaussian interference channel (GIC). Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). The relative performance of the bounds yields insight into the performance limits of multiuser MIMO GICs and the relative merits of different schemes for interference management. These insights are confirmed by establishing the optimality of the bounds in specific cases using an inner bound on the GDOF derived by the authors in a previous work. It is also shown that many of the existing results on the GDOF of the GIC can be obtained as special cases of the bounds, e. g., by setting K = 2 or the number of antennas at each user to 1

Inner Bound on the GDOF of the K-User MIMO Gaussian Symmetric Interference Channel

The K-user multiple input multiple output (MIMO) Gaussian symmetric interference channel where each transmitter has M antennas and each receiver has N antennas is studied from a generalized degrees of freedom (GDOF) perspective. An inner bound on the GDOF is derived using a combination of techniques such as treating interference as noise, zero forcing (ZF) at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, as a function of the number of antennas and the log INR/log SNR level. Several interesting conclusions are drawn from the derived bounds. It is shown that when K > N/M + 1, a combination of the HK and IA schemes performs the best among the schemes considered. When N/M < K <= N/M + 1, the HK-scheme outperforms other schemes and is found to be GDOF optimal in many cases. In addition, when the SNR and INR are at the same level, ZF-receiving and the HK-scheme have the same GDOF performance

Capacity of the Deterministic Z-Interference Channel with Unidirectional Transmitter Cooperation and Secrecy Constraints

This paper derives the capacity region of the 2-user symmetric linear deterministic Z-interference channel (Z-IC) with limited-rate unidirectional cooperation between the transmitters and secrecy constraints at the receivers. The proposed achievable scheme uses a combination of transmission of random bits and interference cancelation. A novel outer bound is derived, based on carefully selecting the side information, and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The derived bounds match, thereby characterizing the secrecy capacity region of the symmetric Z-IC with unidirectional transmitter cooperation. Interestingly, it is found that, in the weak/moderate interference regime, the capacity region does not decrease due to the secrecy constraint at the receiver. Hence, the proposed scheme achieves the capacity of the Z-IC for the weak/moderate interference regime with and without secrecy constraints at the receivers. The results highlight the role of the unidirectional transmitter cooperation in facilitating secure communication over a 2-user Z-IC in the high interference regime